Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
551	Approximate Bayesian computation for the parameters of PRISM programs James Cussens Department of Computer Science & York Centre for Complex Systems Analysis University of York Heslington, York, YO10 5DD, UK. . Add to Reading List Source URL: www.cs.york.ac.uk Language: English - Date: 2010-08-26 11:15:09 Bayesian statistics Econometrics Expectation–maximization algorithm Missing data Maximum likelihood Confidence interval Gamma distribution Likelihood function Hidden Markov model Statistics Estimation theory Statistical theory
552	The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-09-16 13:09:59 Models of computation Mathematics Computer science Combinatorics on words Finite state transducer Tree automaton Finite-state machine Alphabet Regular language Automata theory Formal languages Theoretical computer science
553	Introduction to Computing: Explorations in Language, Logic, and Machines Add to Reading List Source URL: www.computingbook.org Language: English - Date: 2011-08-19 11:52:51 Computability theory Recursion Theoretical computer science Theory of computation Programming idioms Function Algorithm Scheme Tail call Software engineering Computer programming Mathematics
554	Universal Field Machine that Computes Beyond the Turing Limit ´ M. Fernandez ´ Julian Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:36:17 Computer science Halting problem Computability Universal Turing machine Turing machine Computable function Church–Turing thesis Algorithm Alan Turing Computability theory Theoretical computer science Theory of computation
555	. A nondeterministic probabilistic monad with nondeterminism for coalgebraic trace semantics . Add to Reading List Source URL: calco2011.ecs.soton.ac.uk Language: English - Date: 2011-09-18 15:59:28 Software engineering Functional programming Monad Theoretical computer science Models of computation Automata theory Theory of computation
556	Regularity Problems for Weak Pushdown ω-Automata and Games Extended VersionChristof L¨oding and Stefan Repke⋆ Lehrstuhl f¨ ur Informatik 7, RWTH Aachen, Germany Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-09-03 08:07:06 Formal languages Computer science Deterministic pushdown automaton Ω-automaton Pushdown automaton Omega language Nondeterministic finite automaton Context-free language Regular language Automata theory Theoretical computer science Models of computation
557	Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia Add to Reading List Source URL: www.usenix.org Language: English - Date: 2011-06-09 13:31:32 Computational complexity theory Logic gates Circuit complexity Secure multi-party computation Levenshtein distance XOR gate Boolean circuit Circuit Adder Theoretical computer science Applied mathematics Cryptographic protocols
558	Journal of Philosophy, Inc. What Might Cognition Be, If Not Computation? Author(s): Tim Van Gelder Source: The Journal of Philosophy, Vol. 92, No. 7 (Jul., 1995), ppPublished by: Journal of Philosophy, Inc. Add to Reading List Source URL: people.bu.edu Language: English - Date: 2008-10-30 22:08:54 Mechanisms British inventions Cybernetics Centrifugal governor Governor Throttle Steam engine Control theory Mental representation Mechanical engineering Physics Technology
559	BRICS Basic Research in Computer Science BRICS DS-01-6 B. Grobauer: Topics in Semantics-based Program Manipulation Add to Reading List Source URL: www.brics.dk Language: English - Date: 2001-09-24 07:35:52 Logic in computer science Evaluation strategy Incremental computing Partial evaluation Models of computation Denotational semantics Olivier Danvy BRIC Monad Software engineering Computing Programming language theory
560	A Loop Acceleration Technique to Speed Up Verification of Automatically-Generated Plans Robert P. Goldman and Michael J.S. Pelican and David J. Musliner SIFT, LLC 211 N. First St. Minneapolis, MN 55401 Add to Reading List Source URL: icaps11.icaps-conference.org Language: English - Date: 2013-04-15 04:52:48 Applied mathematics Computer science Model checkers Formal methods Logic in computer science Formal verification Model checking State transition system Uppaal Model Checker Models of computation Theoretical computer science Automata theory

UPDATE